A heuristic for an assembly line balancing problem with incompatibility, range, and partial precedence constraints

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

genetic algorithms for assembly line balancing problem

there are some machineries and equipments as well as relatively fix amount of human resources involved in any production process. in many cases, by observing operational method of a process, one may see that some of these machineries are not working, but on the other hand, other equipments are continuously working, and many parts are set in front of them, waiting to be set up over machines to c...

متن کامل

A Bi-Objective Approach to an Assembly Line Re-Balancing Problem: Model and Differential Evolution Algorithms

Assembly lines are special kinds of production systems which are of great importance in the industrial production of high quantity commodities. In many practical manufacturing systems, configuration of assembly lines is fixed and designing a new line may be incurred huge amount of costs and thereby it is not desirable for practitioners. When some changes related to market demand occur, it is wo...

متن کامل

Meta-heuristic Approaches for the Assembly Line Balancing Problem

Assembly line balancing problem (ALBP) is a decision problem arising when designing or redesigning an assembly line and it consists in finding the optimal assignment of tasks among the workstations corresponding to some objectives. This paper deals with the single-model ALBP with the aim of minimizing the cycle time and maximizing the workload smoothness among the workstations. In order to solv...

متن کامل

Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs

This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...

متن کامل

A Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect

Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Industrial Engineering

سال: 1997

ISSN: 0360-8352

DOI: 10.1016/s0360-8352(96)00301-4